Generalized tardiness bounds for global multiprocessor scheduling
نویسندگان
چکیده
منابع مشابه
Tardiness Bounds for Global Multiprocessor Scheduling Algorithms
From 10.02. to 15.02., the Dagstuhl Seminar 08071 Scheduling was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together ...
متن کاملTardiness Bounds under Global EDF Scheduling on a Multiprocessor
This is the review of two papers, Tardiness Bounds under Global EDF Scheduling on a Multiprocessor (RTSS’05) and An O(m) Analysis Technique for Supporting Real-Time Self-Suspending Task Systems (RTSS’12).
متن کاملStochastic Local Search for Multiprocessor Scheduling for Minimum Total Tardiness
The multi-processor total tardiness problem (MPTTP) is an -hard scheduling problem, in which the goal is to minimise the tardiness of a set of jobs that are processed on a number of processors. Exact algorithms like branch and bound have proven to be impractical for the MPTTP, leaving stochastic local search (SLS) algorithms as the main alternative to find high-quality schedules. Among the avai...
متن کاملImproved conditions for bounded tardiness under EPDF Pfair multiprocessor scheduling
The earliest-pseudo-deadline-first (EPDF) Pfair algorithm is more efficient than other known Pfair schedulingalgorithms, but is not optimal for scheduling recurrent real-time task systems on more than two identical pro-cessors. Although not optimal, EPDF may be preferable for real-time systems instantiated on less-powerfulplatforms, those with soft timing constraints, or those whose...
متن کاملBounds for Multiprocessor Scheduling with Resource Constraints
One well-studied model of a multiprocessing system involves a fixed number n of identical abstract processors, a finite set of tasks to be executed, each requiring a specified amount of computation time, and a partial ordering on the tasks which requires certain tasks to be completed before certain others can be initiated. The nonpreemptive operation of the system is guided by an ordered list L...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Real-Time Systems
سال: 2009
ISSN: 0922-6443,1573-1383
DOI: 10.1007/s11241-009-9089-2